منابع مشابه
Entropy of Random Walk Range
We study the entropy of the set traced by an n-step simple symmetric random walk on Z. We show that for d ≥ 3, the entropy is of order n. For d = 2, the entropy is of order n/ log n. These values are essentially governed by the size of the boundary of the trace.
متن کاملLocalization of the maximal entropy random walk.
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In particular, we consider a lattice with weak dilution. We show that the stationary probability of finding a particle performing maximal entropy random walk loca...
متن کاملRange of a Transient 2d-Random Walk
We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed (”averaged”) cases. We also express the rate of growth in terms of the quenched Green function and eventually prove a weak law of large numbers in the (non-Markovian) annealed...
متن کاملMaximal-entropy random walk unifies centrality measures
This paper compares a number of centrality measures and several (dis-)similarity matrices with which they can be defined. These matrices, which are used among others in community detection methods, represent quantities connected to enumeration of paths on a graph and to random walks. Relationships between some of these matrices are derived in the paper. These relationships are inherited by the ...
متن کاملRandom walk with long - range constraints ∗
We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly sampled from all graph homomorphisms from the graph Pn,d to the integersZ, where the graph Pn,d is the discrete segment {0, 1, . . . , n} with edges between v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2010
ISSN: 0246-0203
DOI: 10.1214/09-aihp345